Skip to main content
Scour
Browse
Getting Started
Login
Sign Up
You are offline. Trying to reconnect...
Close
Copied to clipboard
Close
Unable to share or copy to clipboard
Close
🌳 Data Structures
Radix Trees, Merkle Trees, Rope Structures, Persistent Data
Filter Results
Timeframe
Fresh
Past Hour
Today
This Week
This Month
Feeds to Scour
Subscribed
All
Scoured
29393
posts in
55.4
ms
Beyond Bits: An Introduction to
Computation
over the
Reals
📏
Linear Types
arxiv.org
·
1d
·
…
Caching
algorithms without
knowing
how they work
💨
Cache-Friendly Algorithms
blog.autorouting.com
·
4d
·
Hacker News
·
…
vbfs/agent-memory-store
: High-performance MCP memory server for multi-agent systems —
SQLite-backed
with hybrid search.
🔧
Agent Tooling
github.com
·
2d
·
Hacker News
·
…
When
Vectorized
Arrays
Aren't Enough
🔄
SIMD Programming
nrposner.com
·
6d
·
Lobsters
·
…
Why I’m Building a
Database
Engine in C#
🏹
Apache Arrow
nockawa.github.io
·
5d
·
Hacker News
·
…
Bigoish
: Test the
empirical
computational complexity of Rust algorithms
🦀
Rust
docs.rs
·
5d
·
Lobsters
,
Hacker News
·
…
Classifying Identities:
Subcubic
Distributivity
Checking and Hardness from Arithmetic Progression Detection
🔢
Algebraic Data Types
arxiv.org
·
1d
·
…
Constant delay Gray code enumeration of ideals and
antichains
in
posets
🔓
Lock-Free Structures
arxiv.org
·
2d
·
…
Stringological
sequence prediction I: efficient algorithms for predicting highly
repetitive
sequences
🔍
RegEx Engines
arxiv.org
·
2d
·
…
Parameterized
Algorithms for Computing
MAD
Trees
🌳
B+ Trees
arxiv.org
·
1d
·
…
On the
Complexity
of
Determinations
🧮
SMT Solvers
arxiv.org
·
2d
·
…
Persistence-based
topological
optimization: a survey
💾
Persistence Strategies
arxiv.org
·
6d
·
…
Fast
Topology-Aware
Lossy
Data Compression with Full Preservation of Critical Points and Local Order
🗜️
Vector Compression
arxiv.org
·
2d
·
…
On
Lexicographic
Product and
Multi-Word-Representability
🎯
Vector Quantization
arxiv.org
·
1d
·
…
An $\
Omega
( (\log n / \log \log n)^2 )$ Cell-Probe Lower Bound for Dynamic
Boolean
Data Structures
🌸
Bloom Filters
arxiv.org
·
3d
·
…
A Tight
Expressivity
Hierarchy for
GNN-Based
Entity Resolution in Master Data Management
🔄
LLM RAG Pipelines
arxiv.org
·
2d
·
…
PDET-LSH
: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees
🧮
LSH
arxiv.org
·
6d
·
…
Dynamic
Nearest-Neighbor
Searching Under General Metrics in ${\
mathbb
R}^3$ and Its Applications
🔍
Vector Search Algorithms
arxiv.org
·
3d
·
…
Semirings
of formal sums and
injective
partial transformations
🔢
Algebraic Data Types
arxiv.org
·
3d
·
…
List
Estimation
🔍
Vector Search Algorithms
arxiv.org
·
6d
·
…
Loading...
Loading more...
Page 2 »
Keyboard Shortcuts
Navigation
Next / previous item
j
/
k
Open post
o
or
Enter
Preview post
v
Post Actions
Love post
a
Like post
l
Dislike post
d
Undo reaction
u
Recommendations
Add interest / feed
Enter
Not interested
x
Go to
Home
g
h
Interests
g
i
Feeds
g
f
Likes
g
l
History
g
y
Changelog
g
c
Settings
g
s
Browse
g
b
Search
/
Pagination
Next page
n
Previous page
p
General
Show this help
?
Submit feedback
!
Close modal / unfocus
Esc
Press
?
anytime to show this help